On distributed searchHERMAN, T; CHANDY, K. M.Information processing letters. 1985, Vol 21, Num 3, pp 129-133, issn 0020-0190Article

On efficient parallel strong orientationVISHKIN, U.Information processing letters. 1985, Vol 20, Num 5, pp 235-240, issn 0020-0190Article

Depth-first search and Kuratowski subgraphsWILLIAMSON, S. G.Journal of the Association for Computing Machinery. 1984, Vol 31, Num 4, pp 681-693, issn 0004-5411Article

Graph traversal and graph transformationHOLDSWORTH, Jason J.Theoretical computer science. 2004, Vol 321, Num 2-3, pp 215-231, issn 0304-3975, 17 p.Article

On some conditioning results in the probabilistic analysis of algorithmsMCDIARMID, C.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 197-201, issn 0166-218XArticle

A processor efficient MIS algorithm on random graphsYANG, S. B; DHALL, S. K; LAKSHMIVARAHAN, S et al.Information processing letters. 1994, Vol 49, Num 3, pp 157-163, issn 0020-0190Article

Parallel graph algorithmsQUINN, M. J; NARSINGH DEO.ACM computing surveys. 1984, Vol 16, Num 3, pp 319-348, issn 0360-0300Article

Génération, Maintien et Parallélisation de la Fermeture Transitive dans un SGBD Déductif = Generation, Maintenance and Paralleligation of the Transitive Closure in a Deductive DBMSHuang, Yan-Nong.1991, 179 p.Thesis

A simple algorithm for edge-coloring bipartite multigraphsALON, Noga.Information processing letters. 2003, Vol 85, Num 6, pp 301-302, issn 0020-0190, 2 p.Article

Algorithmes parallèles par flux dans les graphes: Des fondements aux applications = Flows parallel graph algorithms: From fundamentals to applicationsLalevee, Philippe; Feautrier, P.1995, 265 p.Thesis

Random walks on weighted graphs and applications to on-line algorithmsCOPPERSMITH, D; DOYLE, P; PRABHAKAR RAGHAVAN et al.Journal of the Association for Computing Machinery. 1993, Vol 40, Num 3, pp 421-453, issn 0004-5411Article

Methods of finding all minimum coverings of a graph by cliquesBRATTSEVA, YE. V; CHERENIN, V. P.Computational mathematics and mathematical physics. 1994, Vol 34, Num 8-9, pp 1103-1118, issn 0965-5425Article

A remark on algorithm 643: FEXACT: An algorithm for performing fisher's exact test in r × c contigency tablesCLARKSON, D. B; FAN, Y; JOE, H et al.ACM transactions on mathematical software. 1993, Vol 19, Num 4, pp 484-488, issn 0098-3500Article

Computing the average distance of an interval graphDANKELMANN, P.Information processing letters. 1993, Vol 48, Num 6, pp 311-314, issn 0020-0190Article

Diamond-free circle graphs are Helly circleDALIGAULT, Jean; GONCALVES, Daniel; RAO, Michaël et al.Discrete mathematics. 2010, Vol 310, Num 4, pp 845-849, issn 0012-365X, 5 p.Article

An O(n log)HASSIN, R; JOHNSON, D. B.SIAM journal on computing (Print). 1985, Vol 14, Num 3, pp 612-624, issn 0097-5397Article

On the longest path algorithm for reconstructing trees from distance matricesREYZIN, Lev; SRIVASTAVA, Nikhil.Information processing letters. 2007, Vol 101, Num 3, pp 98-100, issn 0020-0190, 3 p.Article

A linear algorithm for finding the invariant edges of an edge-weighted graphMALVESTUTO, F. M; MEZZINI, M.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1438-1455, issn 0097-5397, 18 p.Article

Guarding in a simple polygonLU, B.-K; HSU, F.-R; CHUAN YI TANG et al.Information processing letters. 2000, Vol 75, Num 4, pp 153-158, issn 0020-0190Article

The all-pairs quickest path problemLEE, D. T; PAPADOPOULOU, E.Information processing letters. 1993, Vol 45, Num 5, pp 261-267, issn 0020-0190Article

Approximation algorithms for restricted Bayesian network structuresZIEGLER, Valentin.Information processing letters. 2008, Vol 108, Num 2, pp 60-63, issn 0020-0190, 4 p.Article

EIGENVALUES AND SIMPLICITY OF INTERVAL EXCHANGE TRANSFORMATIONSFERENCZI, Sébastien; ZAMBONI, Luca Q.Annales scientifiques de l'Ecole normale supérieure. 2011, Vol 44, Num 3, pp 361-392, issn 0012-9593, 32 p.Article

On the graph turnpike problemFEDER, Tomas; MOTWANI, Rajeev.Information processing letters. 2009, Vol 109, Num 14, pp 774-776, issn 0020-0190, 3 p.Article

A better list heuristic for vertex coverDELBOT, Francois; LAFOREST, Christian.Information processing letters. 2008, Vol 107, Num 3-4, pp 125-127, issn 0020-0190, 3 p.Article

Optimal register allocation for SSA-form programs in polynomial timeHACK, Sebastian; GOOS, Gerhard.Information processing letters. 2006, Vol 98, Num 4, pp 150-155, issn 0020-0190, 6 p.Article